- pseudoprime testing
- проверка чисел на принадлежность к классу псевдопростых
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
pseudoprime testing
Смотреть что такое "pseudoprime testing" в других словарях:
Strong pseudoprime — In number theory, a strong pseudoprime is a composite number that passes a pseudoprimality test. All primes pass this test, but a small fraction of composites pass as well, making them false primes . Unlike the Fermat pseudoprimes, for which… … Wikipedia
Euler pseudoprime — An odd composite integer n is called an Euler pseudoprime to base a , if a and n are coprime, and : a^{(n 1)/2} equiv pm 1pmod{n}(where mod refers to the modulo operation).The motivation for this definition is the fact that all prime numbers p… … Wikipedia
Euler-Jacobi pseudoprime — In number theory, an odd composite integer n is called an Euler Jacobi pseudoprime to base a , if a and n are coprime, and : a ( n − 1)/2 = ( a / n ) (mod n ), where ( a / n ) is the Jacobi symbol.The motivation for this definition is the fact… … Wikipedia
Miller–Rabin primality test — The Miller–Rabin primality test or Rabin–Miller primality test is a primality test: an algorithm which determines whether a given number is prime, similar to the Fermat primality test and the Solovay–Strassen primality test. Its original version … Wikipedia
Probable prime — In number theory, a probable prime (PRP) is an integer that satisfies a specific condition also satisfied by all prime numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Baillie-PSW primality test — In number theory, the Baillie PSW primality test is a probabilistic primality testing heuristic: it determines if a number is composite or a probable prime.The authors of the test offered $30 for the discovery of a composite number that passed… … Wikipedia
Euler's criterion — In mathematics, Euler s criterion is used in determining in number theory whether a given integer is a quadratic residue modulo a prime. DefinitionEuler s criterion states: Let p be an odd prime and a an integer coprime to p . Then a is a… … Wikipedia
Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite … Wikipedia
Fermat primality test — The Fermat primality test is a probabilistic test to determine if a number is probably prime. ConceptFermat s little theorem states that if p is prime and 1 le a < p, then :a^{p 1} equiv 1 pmod{p}If we want to test if p is prime, then we can pick … Wikipedia
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
